P_3-Games
نویسندگان
چکیده
Without further ado, we present the P3-game. The P3-game is decidable for elementary classes of graphs such as paths and cycles. From an algorithmic point of view, the connected P3-game is fascinating. We show that the connected P3-game is polynomially decidable for classes such as trees, chordal graphs, ladders, cacti, outerplanar graphs and circular arc graphs.
منابع مشابه
Solution of the propeller conjecture in $\mathbb{R}^3$
It is shown that every measurable partition ${A_1,..., A_k}$ of $\mathbb{R}^3$ satisfies $$\sum_{i=1}^k||\int_{A_i} xe^{-\frac12||x||_2^2}dx||_2^2\le 9\pi^2.\qquad(*)$$ Let ${P_1,P_2,P_3}$ be the partition of $\mathbb{R}^2$ into $120^\circ$ sectors centered at the origin. The bound is sharp, with equality holding if $A_i=P_i\times \mathbb{R}$ for $i\in {1,2,3}$ and $A_i=\emptyset$ for $i\in \{4...
متن کاملP_3-Games on Chordal Bipartite Graphs
Let G = (V ,E) be a connected graph. A set U ⊆ V is convex if G[U] is connected and all vertices of V \U have at most one neighbor inU. Let σ(W) denote the unique smallest convex set that contains W ⊆ V . Two players play the following game. Consider a convex set U and call it the ‘playground.’ Initially, U = ∅. When U = V , the player to move loses the game. Otherwise, that player chooses a ve...
متن کاملThe crossing numbers of $K_{n,n}-nK_2$, $K_{n}\times P_2$, $K_{n}\times P_3$ and $K_n\times C_4$
The crossing number of a graph G is the minimum number of pairwise intersections of edges among all drawings of G. In this paper, we study the crossing number of Kn,n − nK2, Kn × P2, Kn × P3 and Kn × C4.
متن کاملRings of Singularities
This paper is a slightly revised version of an introduction into singularity theory corresponding to a series of lectures given at the ``Advanced School and Conference on homological and geometrical methods in representation theory'' at the International Centre for Theoretical Physics (ICTP), Miramare - Trieste, Italy, 11-29 January 2010. We show how to associate to a triple of posit...
متن کاملIntegration of Serious Games in Teaching English as a Foreign Language to Iranian Children
Nowadays computers are increasingly being incorporated into school curriculums and serious games are occupying the educational games markets. This article addressed the integration of serious games as tools for learning and teaching English in Iranian schools to zero-beginner students. An experiment was concluded using Computer Assisted Language Learning (CALL) to investigate the effectiveness ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1608.05169 شماره
صفحات -
تاریخ انتشار 2016